https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:37764 0⊆S₁⊆S₂⊆⋯ be defined as follows: S₁ is obtained from S₀ by adding all out-neighbors of vertices in S₀. For k⩾2, S_k is obtained from S_k−1 by adding all vertices w such that for some vertex v∈S_k−1, w is the unique out-neighbor of v in V∖S_k−1. We set M(S)=S₀∪S₁∪⋯, and call S a power dominating set for G if M(S)=V(G). The minimum cardinality of such a set is called the power domination number of G. In this paper, we determine the power domination numbers of de Bruijn and Kautz digraphs.]]> Wed 14 Apr 2021 12:21:11 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31448 Wed 11 Apr 2018 16:43:14 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:37218 Thu 15 Apr 2021 12:01:59 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:27616 Sat 24 Mar 2018 07:39:40 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:27629 γp(G). In this paper, we establish a fundamental result that would provide a lower bound for the power domination number of a graph. Further, we solve the power domination problem in polyphenylene dendrimers, Rhenium Trioxide (ReO3) lattices and silicate networks.]]> Sat 24 Mar 2018 07:34:26 AEDT ]]>